A New Chance-Constrained Maximum Capture Location Problem
نویسندگان
چکیده
The paper presents a new model based on the basic Maximum Capture model, MAXCAP. The New Chance – Constrained Maximum Capture model introduces a stochastic threshold constraint, which recognises the fact that a facility can be open only if a minimum level of demand is captured. A metaheuristic based on MAX – MIN ANT system and TABU search procedure is presented to solve the model. This is the first time that the MAX – MIN ANT system is adapted to solve a location problem. Computational experience and an application to 55 – node network are also presented. 1 This research has been partially financed by research grant MCYT BEC-2000 and the GREL-IET Department of Economics and Business, Universitat Oberta de Catalunya, Avda. Tibidabo, 39-43, 08035 Barcelona (Spain). Tel: 34-3-2542132, Fax: 34-3-4176495. E-mail: [email protected] Department of Economics and Business and GREL-IET, Universitat Pompeu Fabra, Ramon Trias Fargas, 2527, 08005 Barcelona (Spain). Tel: 34-3-5422753, Fax: 34-3-5421746. E-mail: [email protected] Department of Economics and Business and GREL-IET, Universitat Pompeu Fabra, Ramon Trias Fargas, 2527, 08005 Barcelona (Spain). Tel: 34-3-5421666, Fax: 34-3-5421746. E-mail: [email protected]
منابع مشابه
Uncapacitated phub center problem under uncertainty
Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...
متن کاملOptimal Location of Electronic Charity Boxes Using a Hybrid Mathematical Model of Chance Constrained Goal Programming and EDAS Method
Using mathematical modeling of the location problem is effective in optimization of the location of electronic charity boxes. This paper investigates the effective criteria of amount of donation in each district and each type of location, following the determination of study districts, identifying types of locations and extracting conventional charity boxes information. The objectives of the mo...
متن کاملA Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy Demands
In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 122 شماره
صفحات -
تاریخ انتشار 2003